Differently Implicational Universal Triple I Algorithms of ( 1 , 2 , 1 ) Type ⋆
نویسندگان
چکیده
In this paper, the differently implicational universal triple I inference algorithms of fuzzy reasoning are discussed. We generalize fuzzy reasoning triple I algorithms to differently implicational (1, 2, 1) type universal triple I algorithms, and their solutions (FMP universal triple I solution and FMT universal triple I solution) are structured. As the corollaries of the main results in this paper, some special algorithms can be easily derived. In particular, triple I algorithms based on four important residuated implications are special cases of main conclusions.
منابع مشابه
Universal Triple I Method for Fuzzy Reasoning and Fuzzy Controller
As a generalization of the triple I method, the universal triple Imethod is investigated from the viewpoints of both fuzzy reasoningand fuzzy controller. The universal triple I principle is putforward, which improves the previous triple I principle. Then,unified form of universal triple I method is established based onthe (0,1)-implication or R-implication. Moreover, the reversibilityproperty o...
متن کاملFully implicational methods for interval-valued fuzzy reasoning with multi-antecedent rules
Based on the fully implicational idea, we investigate the interval-valued fuzzy reasoning with multiantecedent rules. First, we construct a class of interval-valued fuzzy implications by means of a type of implications and a parameter on the unit interval, then use them to establish three kinds of fully implicational reasoning methods for the interval-valued fuzzy reasoning with multi-anteceden...
متن کاملTypological Universals and Intrinsic Universals on the L2 Acquisition of Consonant Clusters
This study is to examine if typological universals built upon primary languages are applicable to interlanguage data in SLA. Implicational universal is considered the classic example of a typological universal by Croft (2003). Thus, the Interlanguage Structural Conformity Hypothesis, which consists of two implicational universals proposed by Eckman (1991), were tested against data from an inter...
متن کاملDouble Fuzzy Implications-Based Restriction Inference Algorithm
The main condition of the differently implicational inferencealgorithm is reconsidered from a contrary direction, which motivatesa new fuzzy inference strategy, called the double fuzzyimplications-based restriction inference algorithm. New restrictioninference principle is proposed, which improves the principle of thefull implication restriction inference algorithm. Furthermore,focusing on the ...
متن کاملThe Essentially Equational Theory of Horn Classes
It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known [1]. Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes a...
متن کامل